The CL-Buridan System: Probabilistic Planning with Incomplete Information

نویسندگان

  • Steve Hanks
  • Adam Carlson
چکیده

This paper describes (,:LBURl DAN an implementf'd planner for problem domains in whicb tbe agent is uncertain about the initial world state and the effects of its own actions, but has sensors that allow it to improve its state of information. The system uses a probabilistir semantics to represent incomplete information, and provid('s for actions with informational as well as causal effects. The action representation allows an action's causal and information al effpcts to be freely mixed, and can I'f'pTPsent sensors whose informational content is noisy and state dependent. Information obtained at run time can be exploitpd by conditional and looping constructs in the plan language. This paper describ es the basic structure of the CLB l' RI DA 'l representation and algorithm, and also provide an analysis of assumptions about tar!2;et problem domains that would makP thpm an (i.ppropriate (or inappropriate) choice fur using this technology to build a problf'm-solving agent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

"Classical" Planning under Uncertainty*

Research in the classical paradigm has produced effective representations and algorithms for building courses of actions that achieve an input goal. For the most part these systems has~ also assumed an omnipotent and omniscient agent: the agent knows with certainty the initial state of the world and what changes its actions will make, and is assured that no exogenous forces will change the worl...

متن کامل

Probabilistic Planning with Information Gathering and Contingent Execution

Most AI representations and algorithms for plan generation have not included the concept of informationproducing actions (also called diagnostics, or tests, in the decision making literature). We present a planning representation and algorithm that models information-producing actions and constructs plans that exploit the information produced by those actions. We extend the buridan (Kushmerick ...

متن کامل

Revisiting Partial-Order Probabilistic Plannin

We present a partial-order probabilistic planning algorithm that adapts plan-graph based heuristics implemented in Repop. We describe our implemented planner, Reburidan, named after its predecessors Repop and Buridan. Reburidan uses plan-graph based heuristics to first generate a base plan. It then improves this plan using plan refinement heuristics based on the success probability of subgoals....

متن کامل

MAXPLAN: A New Approach to Probabilistic Planning

Classical arti cial intelligence planning techniques can operate in large domains but traditionally assume a deterministic universe. Operations research planning techniques can operate in probabilistic domains but break when the domains approach realistic sizes. maxplan is a new probabilistic planning technique that aims at combining the best of these two worlds. maxplan converts a planning ins...

متن کامل

The Footprint Principle for Heuristics for Probabilistic Planners

Probabilistic back-chaining planners, which use probabilities to represent and reason about uncertainty in the planning domain, typically have a larger search space than their classical counterparts. Therefore heuristics that can reduce their search effectively are even more important. The “footprint” principle leads to a family of heuristics for probabilistic planners produced by attempting to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002